منابع مشابه
On the proper intervalization of colored caterpillar trees
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the picg and a graph layout problem the Proper colored layout problem (pclp). We show a dichotomy: the picg and the pclp are NP-complete for colored ca...
متن کاملThe Proper Interval Colored Graph Problem for Caterpillar Trees
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove our result we make use of a close relationship between intervalizing problems and graph layout problems. We deene a graph layout problem the Proper colored layout problem (pclp)....
متن کاملQuantitative Questions on Attack-Defense Trees
Attack–defense trees are a novel methodology for graphical security modeling and assessment. The methodology includes visual, intuitive tree models whose analysis is supported by a rigorous mathematical formalism. Both, the intuitive and the formal components of the approach can be used for quantitative analysis of attack–defense scenarios. In practice, we use intuitive questions to ask about a...
متن کاملThe Effect of Fruit Trees Pruning Waste Biochar on some Soil Biological Properties under Rhizobox Conditions
The pyrolysis of fruit trees Pruning waste to be converted to biochar with microbial inoculation is a strategy improving the biological properties in calcareous soils. In order to investigate the biochar effect on some soil biological properties of the soil in the presence of microorganisms, a factorial experiment was carried out in a completely randomized design in the rhizobox under greenhous...
متن کاملEvaluation of Attributes on Attack–Defense Trees
Consequently, an ADTree has nodes of two opposite types: attack nodes and defense nodes. The root of an ADTree represents the main goal of the attacker. Every node of an ADTree may have one or more children of the same type representing a refinement into sub-goals of the node’s goal. The refinement of a node can be either disjunctive or conjunctive. The goal of a disjunctively refined node is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1917
ISSN: 0028-0836,1476-4687
DOI: 10.1038/099326a0